Directed Trees in a String, Real Polynomials with Triple Roots, and Chain Mails

نویسنده

  • Dmitry N. Kozlov
چکیده

This paper starts with an observation that two infinite series of simplicial complexes, which a priori do not seem to have anything to do with each other, have the same homotopy type. One series consists of the complexes of directed forests on a double directed string, while the other one consists of Shapiro–Welker models for the spaces of hyperbolic polynomials with a triple root. We explain this coincidence in the more general context by finding an explicit homotopy equivalence between complexes of directed forests on a double directed tree, and doubly disconnecting complexes of a tree.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Classifications of Random Polynomials

 Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...

متن کامل

The coefficients of differentiated expansions of double and triple Jacobi polynomials

Formulae expressing explicitly the coefficients of an expansion of double Jacobi polynomials which has been partially differentiated an arbitrary number of times with respect to its variables in terms of the coefficients of the original expansion are stated and proved. Extension to expansion of triple Jacobi polynomials is given. The results for the special cases of double and triple ultraspher...

متن کامل

A method for analyzing the problem of determining the maximum common fragments of temporal directed tree, that do not change with time

In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...

متن کامل

Parallel Real Root Isolation Using the Descartes Method

Many sequential methods for polynomial real root isolation proceed by interval bisection. The associated binary search trees tend to be narrow and hence do not offer much parallelism. For this reason, it is not obvious how real roots can be isolated in parallel. The paper presents an approach that parallelizes the computations associated with each node of the search tree. In the Descartes metho...

متن کامل

Combinatorics & Topology of Stratifications of the Space of Monic Polynomials with Real Coefficients

We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex calculating (co)homology of its one-point compactification and describe the homotopy type by order complexes of a class of posets of compositions. In the second p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2004